Two variants are available for the connection search:
- Branch & Bound (Connection search using Branch and Bound)
The Branch & Bound search is a multi-criteria search. It finds not only the best but a variety of good connections for a relation. This path set allows different user groups to choose the subjectively best paths. Therefore, this connection search is particularly suitable if fares or other advanced connection attributes, such as comfort, are to be taken into account in the model and the route choice of passengers is to be used for an analysis of line volumes.
- Shortest path search (Connection search using shortest path search)
The shortest path search finds the best path for each departure time. Due to this temporal independence of the individual paths, the found path set remains stable compared to the introduction of individual very good connections, unlike the search with Branch & Bound (Bounding). This stable path set and its short run time make this connection search attractive when the calculation of skims is the goal of the assignment or the public transport impedance is defined only by journey time and transfers.
